Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of

Source URL: ndmitchell.com

• Software engineering
• Computer programming
• Declarative programming
• Functional programming
• Data types
• Programming language comparisons
• Type theory
• Higher-order functions
• Fold
• Generic programming
• Map
• Type class

Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant tifact “Every block of stone has a statue inside it and it is the task of the sculptor to discover it.”

Source URL: pit-claudel.fr

Deriving a Relationship from a Single Example Neil Mitchell Abstract Given an appropriate domain specific language (DSL), it is possible

Source URL: ndmitchell.com

• Software engineering
• Computer programming
• Declarative programming
• Functional programming
• Data types
• Type theory
• Programming language comparisons
• Functional languages
• Monad
• Generic programming
• Type class
• Algebraic data type

Object-Oriented Programming Versus Abstract Data Types William R. Cook Hewlett-Packard Laboratories 1501 Page Mill Road, Palo Alto, CA, , USA

Source URL: www.cs.utexas.edu

Model Checking Recursive Programs with Numeric Data Types Matthew Hague and Anthony Widjaja Lin Oxford University Computing Laboratory Abstract. Pushdown systems (PDS) naturally model sequential recursive programs. Nume

Source URL: www.cs.rhul.ac.uk

Value Sensitivity and Observable Abstract Values for Information Flow Control Luciano Bello1 , Daniel Hedin1,2 , and Andrei Sabelfeld1 1 Chalmers University of Technology

Source URL: www.cse.chalmers.se

• Data types
• Type theory
• Typeof
• Variable
• High Speed 2
• Information flow
• Dynamical system
• Monad
• Type system
• Operator

Efficient Coflow Scheduling Without Prior Knowledge Mosharaf Chowdhury, Ion Stoica UC Berkeley {mosharaf, istoica}@cs.berkeley.edu

Source URL: www.mosharaf.com

• Scheduling algorithms
• Operations research
• Network performance
• Queueing theory
• Scheduling computing)
• Abstract data types
• Planning
• Scheduling
• Multilevel feedback queue
• Fair queuing
• Job scheduler
• Priority queue

Declarative foreign function binding through generic programming Jeremy Yallop, David Sheets and Anil Madhavapeddy University of Cambridge Computer Laboratory Abstract. Foreign function interfaces are typically organise

Source URL: anil.recoil.org

• Software engineering
• Computer programming
• Computing
• C++
• C
• Data types
• Object-oriented programming languages
• Functional languages
• Typedef
• OCaml
• Const
• Pointer

Tracing ambiguity in GADT type inference Jacques Garrigue∗ Didier R´emy† Abstract

Source URL: www.math.nagoya-u.ac.jp

• Type theory
• Data types
• Functional languages
• Type systems
• Object-oriented programming languages
• OCaml
• Type inference
• Generalized algebraic data type
• Unification
• ML
• HindleyMilner type system
• Type conversion

A Static Analyzer for Large Safety-Critical Software (Extended Abstract) Bruno Blanchet ∗ § Laurent Mauborgne § Patrick Cousot §

Source URL: www-verimag.imag.fr

• Computing
• Software engineering
• Computer programming
• Abstract interpretation
• Data types
• Functional languages
• Denotational semantics
• Function
• Array data type
• Scala
• Widening
• Data-flow analysis